منابع مشابه
Combinatorial pseudo-triangulations
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of [4] which treats the minimally generically rigid case. The proof uses the concept of combinatorial pseudo-triangulation, CPT, in the plane and has two main steps: showing that a certain " generalized Laman property " is a necessary and s...
متن کاملM ar 2 00 5 COMBINATORIAL PSEUDO - TRIANGULATIONS
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of [4] which treats the minimally generically rigid case. The proof uses the concept of combinatorial pseudo-triangulation, CPT, in the plane and has two main steps: showing that a certain " generalized Laman property " is a necessary and s...
متن کاملCounting triangulations and pseudo-triangulations of wheels
Motivated by several open questions on triangulations and pseudotriangulations, we give closed form expressions for the number of triangulations and the number of minimum pseudo-triangulations of n points in wheel configurations, that is, with n − 1 in convex position. Although the numbers of triangulations and pseudotriangulations vary depending on the placement of the interior point, their di...
متن کاملMinimum Weight Pseudo-Triangulations
We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first present an O(n log n)-time algorithm that produces a pseudo-triangulation of weight O(wt(M(S)) · log n) which is shown to be asymptotically worstcase optimal, i.e., there exists a point set S for which every pseudotriangulation has weight Ω(log n · wt(M(S))), where wt(M(S)) i...
متن کاملConvexity minimizes pseudo-triangulations
The number of minimum pseudo-triangulations is minimized for point sets in convex position.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.09.045